翻訳と辞書
Words near each other
・ Generalized processor sharing
・ Generalized Procrustes analysis
・ Generalized pustular psoriasis
・ Generalized quadrangle
・ Generalized quantifier
・ Generalized randomized block design
・ Generalized relative entropy
・ Generalized Riemann hypothesis
・ Generalized second-price auction
・ Generalized selection
・ Generalized semi-infinite programming
・ Generalized signal averaging
・ Generalized singular value decomposition
・ Generalized spectrogram
・ Generalized star height problem
Generalized suffix tree
・ Generalized symmetric group
・ Generalized System of Preferences
・ Generalized taxicab number
・ Generalized Timing Formula
・ Generalized Tobit
・ Generalized tree alignment
・ Generalized trichoepithelioma
・ Generalized trigonometry
・ Generalized TTL security mechanism
・ Generalized vaccinia
・ Generalized valence bond
・ Generalized vector space model
・ Generalized Verma module
・ Generalized Wiener filter


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Generalized suffix tree : ウィキペディア英語版
Generalized suffix tree

In computer science, a generalized suffix tree is a suffix tree for a set of strings. Given the set of strings D=S_1,S_2,\dots,S_d of total length n, it is a Patricia tree containing all n suffixes of the strings. It is mostly used in bioinformatics.〔
== Functionality ==
It can be built in \Theta(n) time and space, and can be used to find all z occurrences of a string P of length m in O(m + z) time, which is asymptotically optimal (assuming the size of the alphabet is constant〔).
When constructing such a tree, each string should be padded with a unique out-of-alphabet marker symbol (or string) to ensure no suffix is a substring of another, guaranteeing each suffix is represented by a unique leaf node.
Algorithms for constructing a GST include Ukkonen's algorithm (1995) and McCreight's algorithm (1976).

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Generalized suffix tree」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.